Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
541	Review of1 of The P = NP Question and Godel’s Lost Letter by Richard J. Lipton Springer, [removed]pages, Hardcover Review by Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2010-10-04 09:51:41 Complexity classes NP-complete problems Mathematical optimization Conjectures P versus NP problem Structural complexity theory NP Integer factorization Richard J. Lipton Theoretical computer science Computational complexity theory Applied mathematics
542	The Traveling Salesman (& J ) Peter G. Anderson, Computer Science Department Rochester Institute of Technology, Rochester, New York [removed] Add to Reading List Source URL: www.cs.rit.edu Language: English - Date: 2003-06-11 09:35:55 Complexity classes NP-complete problems Operations research Mathematical optimization Spanning tree Travelling salesman problem Minimum spanning tree NP-hard NP-complete Theoretical computer science Computational complexity theory Applied mathematics
543	Joint Review of1 Computational Complexity: A Conceptual Perspective by Oded Goldreich Published by Cambridge University Press, [removed]pages, Hardcover and Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2010-09-24 20:19:20 Complexity classes Probabilistic complexity theory Structural complexity theory Models of computation Pseudorandom generator Probabilistically checkable proof NP P versus NP problem Bounded-error probabilistic polynomial Theoretical computer science Computational complexity theory Applied mathematics
544	Report on Dagstuhl Seminar[removed]Semantics of Information Organized by Michael Mislove Tulane University Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2010-09-14 03:18:34 Models of computation Quantum information science Computational complexity theory Classes of computers Quantum computer Khovanov homology Quantum algorithm Quantum circuit Algorithm Theoretical computer science Applied mathematics Mathematics
545	ACSIJ Advances in Computer Science: an International Journal, Vol. 3, Issue 3, No.9 , May 2014 ISSN : [removed]www.ACSIJ.org Max Kanovich1 , Tajana Ban Kirigin2 , Vivek Nigam3 , and Andre Scedrov4 1 University Add to Reading List Source URL: bib.irb.hr Language: English - Date: 2014-08-21 13:13:52 Computer science Petri net Computational complexity theory Cryptographic nonce Multiset P NL Complexity classes Applied mathematics Mathematics
546	Towards Ecient Universal Planning\|A Randomized Approach Peter Jonsson, Patrik Haslum and Christer Backstrom Department of Computer and Information Science Linkoping University, S[removed]Linkoping, Sweden fpetej,paha Add to Reading List Source URL: www.ida.liu.se Language: English - Date: 2012-02-01 04:30:41 Applied mathematics Polynomial hierarchy P SL L NC Time complexity FO Completeness Theoretical computer science Computational complexity theory Complexity classes
547	16th Canadian Conference on Computational Geometry, 2004 The Box Mover Problem Valentin Polishchuk Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Complexity classes Mathematical optimization Structural complexity theory NP-complete problems Sokoban NP-complete NP P versus NP problem Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
548	Complexity of Bézout’s Theorem and the Condition Number Jean-Pierre Dedieu Institut de Mathématiques de Toulouse, France Fields Institute, Thematic Program on the Foundations of Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2009-10-23 10:42:16 Computational complexity theory Complexity classes Abstraction Complex systems theory Complexity Holism PP Polynomial P Theoretical computer science Algebra Mathematics
549	Microsoft Word - Gold FP vs Classic Q A.doc Add to Reading List Source URL: www.massagewarehouse.com Language: English - Date: 2013-02-20 08:40:50 TeX Application software Publishing Complexity classes FP Typography
550	Weakly-Supervised Bayesian Learning of a CCG Supertagger Dan Garrette, Chris Dyer, Jason Baldridge, Noah A. Smith UT-Austin, CMU Principle #1: Simplicity Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2015-01-12 20:53:04 Complexity classes NP

UPDATE